Stability of Non-diagonalizable Networks: Eigenvalue Analysis

نویسندگان

  • LinYing Xiang
  • Zengqiang Chen
  • Jonathan J. H. Zhu
چکیده

The stability of non-diagonalizable networks of dynamical systems are investigated in detail based on eigenvalue analysis. Pinning control is suggested to stabilize the synchronization state of the whole coupled network. The complicated coupled problem is reduced to two independent problems: clarifying the stable region of the modified system and specifying the eigenvalue distribution of the coupling and control matrix. The dependence of the stability on both pinning density and pinning strength is studied.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eigenvalue calculator for Islanded Inverter-Based Microgrids

The stability analysis of islanded inverter-based microgrids (IBMGs) is increasingly an important and challenging topic due to the nonlinearity of IBMGs. In this paper, a new linear model for such microgrids as well as an iterative method to correct the linear model is proposed. Using the linear model makes it easy to analyze the eigenvalues and stability of IBMGs due to the fact that it derive...

متن کامل

A Cross Eigenvalue Condition Matrix

We introduce a cross eigenvalue condition matrix for measuring the sensitivity of eigenvalue computations. A fundamental difference between this new object and traditional eigenvalue condition numbers is that cross interactions between eigenvectors that are not associated with the same eigenvalue are taken into account. We develop an abstract formulation that makes it possible to define continu...

متن کامل

Potential Diagonalizability

Example 1. The matrix ( 0 −1 1 0 ) in M2(R) is not diagonalizable, but it becomes diagonalizable in M2(C) since its characteristic polynomial splits with distinct roots in C[T ]. Example 2. The matrix ( 1 1 0 1 ) is not diagonalizable over any field. Indeed, its only eigenvalue is 1 and its only eigenvectors are scalar multiples of ( 1 0 ) , so there is never a basis of eigenvectors for this ma...

متن کامل

Gerschgorin's theorem for generalized eigenvalue problems in the Euclidean metric

We present Gerschgorin-type eigenvalue inclusion sets applicable to generalized eigenvalue problems. Our sets are defined by circles in the complex plane in the standard Euclidean metric, and are easier to compute than known similar results. As one application we use our results to provide a forward error analysis for a computed eigenvalue of a diagonalizable pencil.

متن کامل

Proof of a trace inequality in matrix algebra

for all complex vectors ai and bj . One can easily prove that if X is positive definite then X is hermitian (see, e.g., Ref. [1], p. 65). Since the eigenvalues of hermitian matrices are real, it is easy to prove that the eigenvalues of positive definite matrices are real and positive. Moreover, a positive definite matrix is invertible, since it does not possess a zero eigenvalue. Note that a no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009